Tutorial on Admissible Rules in Gudauri
نویسنده
چکیده
Most theorems have more than one proof and most theories have more than one axiomatization. Certain proofs or axiomatizations are preferable to others because they are shorter or more transparent or for some other reason. Our aim is to describe or study the possible proofs of a theorem or the possible axiomatizations of a theory. As the former is a special instance of the latter, by considering a theory consisting of one theorem, it suffices to consider theories. To describe the possible axiomatizations of a theory we first have to specify what we mean by a theory and what counts as an axiomatization of it. We assume that theories are given by consequence relations, and consider an arbitrary consequence relation to be an axiomatization of the theory if it has the same theorems as the consequence relation of the theory. In [1] Avron argues convincingly that in general a logic is more than its set of theorems, meaning that there exist logics which have the same set of theorems but which nevertheless do not seem to be equal. For example, because the proofs of certain theorems differ with the logic. Then the question what counts as an axiomatization of a certain theory becomes more complex in that one wishes to axiomatize certain other characteristics of the theory, such as certain inference steps, rather than just its theorems. In this paper, however, we restrict ourselves to the set of theorems as that part of a theory that an axiomatization has to capture. And as we will see, already in this case the variety of possible axiomatizations of a theory can be quite complicated and is in many cases not yet well-understood. Thus our main aim is a description of the consequence relations that have the same theorems as a given consequence relation. As it turns out, admissible rules are the central notion here, where a rule is admissible in a theory if it can be added to a theory but no new theorems can be proved in the extension. Clearly, such extensions are axiomatizations of the original theory, which is why admissible rules are so important in this setting.
منابع مشابه
Intermediate Logics and Visser's Rules
Visser’s rules form a basis for the admissible rules of IPC. Here we show that this result can be generalized to arbitrary intermediate logics: Visser’s rules form a basis for the admissible rules of any intermediate logic L for which they are admissible. This implies that if Visser’s rules are derivable for L then L has no non-derivable admissible rules. We also provide a necessary and suffici...
متن کاملThe rules of intermediate logic
If Visser’s rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate logics for which not all of Visser’s rules are admissible is not known. Here we study the situation for specific intermediate logics. We provide natural examples of logics for which Visser’s rule are derivable, admissible b...
متن کاملDevelopment and Usability Evaluation of an Online Tutorial for “How to Write a Proposal” for Medical Sciences Students
Background and Objective: Considering the importance of learning how to write a proposal for students, this study was performed to develop an online tutorial for “How to write a Proposal” for students and to evaluate its usability. Methods: This study is a developmental research and tool design. “Gamified Online Tutorial based on Self-Determination Theory (GOT-STD) Framework" became the basis f...
متن کاملOn The Admissible Rules of Intuitionistic Propositional Logic
We present a basis for the admissible rules of intuitionistic proposi-tional logic. Thereby a conjecture by de Jongh and Visser is proved. We also present a proof system for the admissible rules, and give semantic criteria for admissibility.
متن کاملA Note on Globally Admissible Inference Rules for Modal and Superintuitionistic Logics
In this shot note we consider globally admissible inference rules. A rule r is globally admissible in a logic L if r is admissible in all logics with the finite model property which extend L. Here we prove a reduction theorem: we show that, for any modal logic L extending K4, a rule r is globally admissible in L iff r is admissible in all tabular logics extending L. The similar result holds for...
متن کامل